The first order theory of primal grammars is decidable
نویسندگان
چکیده
منابع مشابه
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is equal to the number of elements stored in the data structure. Using a program analysis framework that supports abstraction of data structures as sets, such constraints can be expressed using the language of sets with c...
متن کاملDecidable fragments of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملDecidable Fragments of First-Order Modal Logics
The paper considers the set ML1 of rst-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using the mosaic technique, we prove a general satissability criterion for formulas in ML1 which reduces the modal satissability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragm...
متن کاملDecidable fragment of first-order temporal logics
In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...
متن کاملBisimulation equivalence of first-order grammars is Ackermann-hard
Bisimulation equivalence (or bisimilarity) of first-order grammars is decidable, as follows from the decidability result by Sénizergues (1998, 2005) that has been given in an equivalent framework of equational graphs with finite out-degree, or of pushdown automata (PDA) with only deterministic and popping ε-transitions. Benedikt, Göller, Kiefer, and Murawski (2013) have shown that the bisimilar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.04.007